Automata-based verification of programs with tree updates
نویسندگان
چکیده
منابع مشابه
Automata-Based Abstraction for Automated Verification of Higher-Order Tree-Processing Programs
Higher-order model checking has been recently applied to automated verification of higher-order functional programs, but there have been difficulties in dealing with algebraic data types such as lists and trees. To remedy the problem, we propose an automata-based abstraction of tree data, and a counterexample-guided refinement of the abstraction. By combining them with higher-order model checki...
متن کاملVerification of Tree Updates for Optimization
With the rise of XML as a standard format for representing treeshaped data, new programming tools have emerged for specifying transformations to tree-like structures. A recent example along this line are the update languages of [16, 15, 8] which add tree update primitives on top of the declarative query languages XPath and XQuery. These tree update languages use a “snapshot semantics”, in which...
متن کاملA Method for Automatic Runtime Verification of Automata-Based Programs
Model Checking is the only practically used method for verification of automata-based programs. However, current implementations of this method only allow verification of simple automata systems. We suggest using a different approach, runtime verification, for verification of automata systems. We discuss advantages and disadvantages of this approach, propose a method for automatic verification ...
متن کاملAutomata-Based Verification of Temporal Properties on Running Programs
This paper presents an approach to checking a running program against Linear Temporal Logic (LTL) specifications. LTL is a widely used logic for expressing properties of programs viewed as sets of executions. Our approach consists of translating LTL formulae to finitestate automata, which are used as observers of the program behavior. The translation algorithm we propose modifies standard LTL t...
متن کاملVerification of Pointer Programs Based on Forest Automata
In this work, we develop an existing method for shape analysis based on so called forest automata, and we also improve its implementation, the tool Forester. Forest automata are based on tree automata and Forester includes a simple implementation of tree automata. Our first contribution is replacing this implementation by a general purpose tree automata library VATA, which contains highly optim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Informatica
سال: 2009
ISSN: 0001-5903,1432-0525
DOI: 10.1007/s00236-009-0108-5